On the metric properties of discrete space-filling curves
نویسندگان
چکیده
منابع مشابه
On the metric properties of discrete space-filling curves
A space-filling curve is a linear traversal of a discrete finite multidimensional space. In order for this traversal to be useful in many applications, the curve should preserve "locality". We quantify "locality" and bound the locality of multidimensional space-filling curves. Classic Hilbert space-filling curves come close to achieving optimal locality.
متن کاملUnconventional Space-filling Curves
A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new space-filling curve distinct and much different from Hilbert’s, Peano’s, and the Z-order, we first observe that all three of these curves are based on self-similar fractals–in particular, the recursive definition of the sequences of functions that converge to t...
متن کاملA Optimality of Clustering Properties of Space Filling Curves
Space filling curves have been used in the design of data structures for multidimensional data since many decades. A fundamental quality metric of a space filling curve is its “clustering number” with respect to a class of queries, which is the average number of contiguous segments on the space filling curve that a query region can be partitioned into. We present a characterization of the clust...
متن کاملExploiting Novel Properties of Space-Filling Curves for Data Analysis
Using space-filling curves to order multidimensional data has been found to be useful in a variety of application domains. This paper examines the space-filling curve induced ordering of multidimensional data that has been transformed using shape preserving transformations. It is demonstrated that, although the orderings are not invariant under these transformations, the probability of an order...
متن کاملEfficient Neighbor-Finding on Space-Filling Curves
Space-filling curves (SFC, also known as FASS-curves) are a useful tool in scientific computing and other areas of computer science to sequentialize multidimensional grids in a cache-efficient and parallelization-friendly way for storage in an array. Many algorithms, for example grid-based numerical PDE solvers, have to access all neighbor cells of each grid cell during a grid traversal. While ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Image Processing
سال: 1996
ISSN: 1057-7149
DOI: 10.1109/83.499920